Cullen Numbers with the Lehmer Property

نویسندگان

  • JOSÉ MARÍA GRAU
  • Matthew A. Papanikolas
چکیده

Here, we show that there is no positive integer n such that the nth Cullen number Cn = n2n + 1 has the property that it is composite but φ(Cn) | Cn − 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN Õ(log(N)) TIME PRIMALITY TEST FOR GENERALIZED CULLEN NUMBERS

Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...

متن کامل

An Õ(log2(N)) time primality test for generalized Cullen numbers

Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...

متن کامل

Invariance in the Class of Weighted Lehmer Means

We study invariance in the class of weighted Lehmer means. Thus we look at triples of weighted Lehmer means with the property that one is invariant with respect to the other two.

متن کامل

Repunit Lehmer numbers

A Lehmer number is a composite positive integer n such that φ(n) | n− 1. In this paper, we show that given a positive integer g > 1 there are at most finitely many Lehmer numbers which are repunits in base g, and they are all effectively computable. Our method is effective and we illustrate it by showing that there is no such Lehmer number when g ∈ [2, 1000]. 2000 Mathematics Subject Classifica...

متن کامل

Sierpiński and Carmichael numbers

We establish several related results on Carmichael, Sierpiński and Riesel numbers. First, we prove that almost all odd natural numbers k have the property that 2nk + 1 is not a Carmichael number for any n ∈ N; this implies the existence of a set K of positive lower density such that for any k ∈ K the number 2nk + 1 is neither prime nor Carmichael for every n ∈ N. Next, using a recent result of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011